'Weak Dependency Graph [60.0]'
------------------------------
Answer:           YES(?,O(n^1))
Input Problem:    innermost runtime-complexity with respect to
  Rules:
    {  p(s(x)) -> x
     , fac(0()) -> s(0())
     , fac(s(x)) -> times(s(x), fac(p(s(x))))}

Details:         
  We have computed the following set of weak (innermost) dependency pairs:
   {  p^#(s(x)) -> c_0()
    , fac^#(0()) -> c_1()
    , fac^#(s(x)) -> c_2(fac^#(p(s(x))))}
  
  The usable rules are:
   {p(s(x)) -> x}
  
  The estimated dependency graph contains the following edges:
   {fac^#(s(x)) -> c_2(fac^#(p(s(x))))}
     ==> {fac^#(s(x)) -> c_2(fac^#(p(s(x))))}
   {fac^#(s(x)) -> c_2(fac^#(p(s(x))))}
     ==> {fac^#(0()) -> c_1()}
  
  We consider the following path(s):
   1) {  fac^#(s(x)) -> c_2(fac^#(p(s(x))))
       , fac^#(0()) -> c_1()}
      
      The usable rules for this path are the following:
      {p(s(x)) -> x}
      
        We have oriented the usable rules with the following strongly linear interpretation:
          Interpretation Functions:
           p(x1) = [1] x1 + [1]
           s(x1) = [1] x1 + [0]
           fac(x1) = [0] x1 + [0]
           0() = [0]
           times(x1, x2) = [0] x1 + [0] x2 + [0]
           p^#(x1) = [0] x1 + [0]
           c_0() = [0]
           fac^#(x1) = [0] x1 + [0]
           c_1() = [0]
           c_2(x1) = [0] x1 + [0]
        
        We have applied the subprocessor on the resulting DP-problem:
        
          'Weight Gap Principle'
          ----------------------
          Answer:           YES(?,O(n^1))
          Input Problem:    innermost DP runtime-complexity with respect to
            Strict Rules: {fac^#(0()) -> c_1()}
            Weak Rules:
              {  p(s(x)) -> x
               , fac^#(s(x)) -> c_2(fac^#(p(s(x))))}
          
          Details:         
            We apply the weight gap principle, strictly orienting the rules
            {fac^#(0()) -> c_1()}
            and weakly orienting the rules
            {  p(s(x)) -> x
             , fac^#(s(x)) -> c_2(fac^#(p(s(x))))}
            using the following strongly linear interpretation:
              Processor 'Matrix Interpretation' oriented the following rules strictly:
              
              {fac^#(0()) -> c_1()}
              
              Details:
                 Interpretation Functions:
                  p(x1) = [1] x1 + [0]
                  s(x1) = [1] x1 + [8]
                  fac(x1) = [0] x1 + [0]
                  0() = [6]
                  times(x1, x2) = [0] x1 + [0] x2 + [0]
                  p^#(x1) = [0] x1 + [0]
                  c_0() = [0]
                  fac^#(x1) = [1] x1 + [2]
                  c_1() = [0]
                  c_2(x1) = [1] x1 + [0]
              
            Finally we apply the subprocessor
            'Empty TRS'
            -----------
            Answer:           YES(?,O(1))
            Input Problem:    innermost DP runtime-complexity with respect to
              Strict Rules: {}
              Weak Rules:
                {  fac^#(0()) -> c_1()
                 , p(s(x)) -> x
                 , fac^#(s(x)) -> c_2(fac^#(p(s(x))))}
            
            Details:         
              The given problem does not contain any strict rules
      
   2) {fac^#(s(x)) -> c_2(fac^#(p(s(x))))}
      
      The usable rules for this path are the following:
      {p(s(x)) -> x}
      
        We have oriented the usable rules with the following strongly linear interpretation:
          Interpretation Functions:
           p(x1) = [1] x1 + [1]
           s(x1) = [1] x1 + [0]
           fac(x1) = [0] x1 + [0]
           0() = [0]
           times(x1, x2) = [0] x1 + [0] x2 + [0]
           p^#(x1) = [0] x1 + [0]
           c_0() = [0]
           fac^#(x1) = [0] x1 + [0]
           c_1() = [0]
           c_2(x1) = [0] x1 + [0]
        
        We have applied the subprocessor on the resulting DP-problem:
        
          'Weight Gap Principle'
          ----------------------
          Answer:           YES(?,O(n^1))
          Input Problem:    innermost DP runtime-complexity with respect to
            Strict Rules: {fac^#(s(x)) -> c_2(fac^#(p(s(x))))}
            Weak Rules: {p(s(x)) -> x}
          
          Details:         
            'fastest of 'combine', 'Bounds with default enrichment', 'Bounds with default enrichment''
            ------------------------------------------------------------------------------------------
            Answer:           YES(?,O(n^1))
            Input Problem:    innermost DP runtime-complexity with respect to
              Strict Rules: {fac^#(s(x)) -> c_2(fac^#(p(s(x))))}
              Weak Rules: {p(s(x)) -> x}
            
            Details:         
              The problem was solved by processor 'Bounds with default enrichment':
              'Bounds with default enrichment'
              --------------------------------
              Answer:           YES(?,O(n^1))
              Input Problem:    innermost DP runtime-complexity with respect to
                Strict Rules: {fac^#(s(x)) -> c_2(fac^#(p(s(x))))}
                Weak Rules: {p(s(x)) -> x}
              
              Details:         
                The problem is Match-bounded by 1.
                The enriched problem is compatible with the following automaton:
                {  p_1(11) -> 10
                 , s_0(2) -> 2
                 , s_0(2) -> 10
                 , s_1(2) -> 11
                 , fac^#_0(2) -> 8
                 , fac^#_1(10) -> 9
                 , c_2_1(9) -> 8
                 , c_2_1(9) -> 9}
      
   3) {p^#(s(x)) -> c_0()}
      
      The usable rules for this path are empty.
      
        We have oriented the usable rules with the following strongly linear interpretation:
          Interpretation Functions:
           p(x1) = [0] x1 + [0]
           s(x1) = [0] x1 + [0]
           fac(x1) = [0] x1 + [0]
           0() = [0]
           times(x1, x2) = [0] x1 + [0] x2 + [0]
           p^#(x1) = [0] x1 + [0]
           c_0() = [0]
           fac^#(x1) = [0] x1 + [0]
           c_1() = [0]
           c_2(x1) = [0] x1 + [0]
        
        We have applied the subprocessor on the resulting DP-problem:
        
          'Weight Gap Principle'
          ----------------------
          Answer:           YES(?,O(n^1))
          Input Problem:    innermost DP runtime-complexity with respect to
            Strict Rules: {p^#(s(x)) -> c_0()}
            Weak Rules: {}
          
          Details:         
            We apply the weight gap principle, strictly orienting the rules
            {p^#(s(x)) -> c_0()}
            and weakly orienting the rules
            {}
            using the following strongly linear interpretation:
              Processor 'Matrix Interpretation' oriented the following rules strictly:
              
              {p^#(s(x)) -> c_0()}
              
              Details:
                 Interpretation Functions:
                  p(x1) = [0] x1 + [0]
                  s(x1) = [1] x1 + [0]
                  fac(x1) = [0] x1 + [0]
                  0() = [0]
                  times(x1, x2) = [0] x1 + [0] x2 + [0]
                  p^#(x1) = [1] x1 + [1]
                  c_0() = [0]
                  fac^#(x1) = [0] x1 + [0]
                  c_1() = [0]
                  c_2(x1) = [0] x1 + [0]
              
            Finally we apply the subprocessor
            'Empty TRS'
            -----------
            Answer:           YES(?,O(1))
            Input Problem:    innermost DP runtime-complexity with respect to
              Strict Rules: {}
              Weak Rules: {p^#(s(x)) -> c_0()}
            
            Details:         
              The given problem does not contain any strict rules